EPTAS for load balancing problem on parallel machines with a non-renewable resource
نویسندگان
چکیده
The problem considered is the non-preemptive scheduling of independent jobs that consume a resource (which non-renewable and replenished regularly) on parallel uniformly related machines. input defines speed machines, size jobs, quantity required by quantities, replenishment dates resource. Every job can start processing only after allocated to job. objective function generalization makespan minimization lp-norm vector loads We present an EPTAS for this problem. Prior our work PTAS was known in settings special case identical
منابع مشابه
a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولLoad Balancing Problem for Parallel Computers with Distributed Memory
This paper deals with load balancing of parallel algorithms for distributedmemory computers. The parallel versions of BLAS subroutines for matrix-vector product and LU factorization are considered. Two task partitioning algorithms are investigated and speed-ups are calculated. The cases of homogeneous and heterogeneous collections of computers/processors are studied, and special partitioning al...
متن کاملModeling the Scheduling Problem of Identical Parallel Machines with Load Balancing by Time Petri Nets
The optimal resources allocation to tasks was the primary objective of the research dealing with scheduling problems. These problems are characterized by their complexity, known as NP-hard in most cases. Currently with the evolution of technology, classical methods are inadequate because they degrade system performance (inflexibility, inefficient resources using policy, etc.). In the context of...
متن کاملOn-line Load Balancing for Related Machines
We consider the problem of schedulingpermanent jobs on related machines in an on-line fashion. We design a new algorithm that achieves the competitive ratio of for the deterministic version, and for its randomized variant, improving the previous competitive ratios of 8 and ! " # . We also prove lower bounds of $ on the competitive ratio of deterministic algorithms and % on the competitive ratio...
متن کاملA New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2023
ISSN: ['1873-636X', '1572-5286']
DOI: https://doi.org/10.1016/j.disopt.2023.100775